Are There Teleological Functions to Compute?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

P30: Are There Anxious Genes?

Anxiety comprises many clinical descriptions and phenotypes. A genetic predisposition to anxiety is undoubted; however, the nature and extent of that contribution is still unclear. Extensive genetic studies of the serotonin (5-hydroxytryptamine, 5-HT) transporter (5-HTT) gene have revealed how variation in gene expression can be correlated with anxiety phenotypes. Complete genome-wide linkage s...

متن کامل

Using Generating Functions to Compute Concurrency

We present succinctly the Arnold-Nivat's model for the synchronization of sequential preocesses, and we recall the concurrency measure defined by Beauquier, Dérard and Thimonier. We present here a new technics for the computation of this measure avoiding very often a very expensive part of the computation. We illustrate this method by the mutual exclusion example.

متن کامل

Robust Estimators are Hard to Compute

In modern statistics, the robust estimation of parameters of a regression hyperplane is a central problem. Robustness means that the estimation is not or only slightly affected by outliers in the data. In this paper, it is shown that the following robust estimators are hard to compute: LMS, LQS, LTS, LTA, MCD, MVE, Constrained M estimator, Projection Depth (PD) and Stahel-Donoho. In addition, a...

متن کامل

There are no p-Complete Families of Symmetric Boolean Functions

Valiant [2,3] and Skyum and Valiant [l] developed a complexity theory based on Boolean algebra. In this theory, a problem is represented as a family of Boolean functions and complexity classes are defined as sets of problems, which can be reduced to each other using projections. In contrast to the usual Turing machine reducibilities, projection is a very tight notion of reducibility since it do...

متن کامل

Wendland Functions - A C++ Code to Compute Them

In this paper we present a code in C++ to compute Wendland functions for arbitrary smoothness parameters. Wendland functions are compactly supported Radial Basis Functions that are used for interpolation of data or solving Partial Differential Equations with mesh-free collocation. For the computations of Lyapunov functions using Wendland functions their derivatives are also needed so we include...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Philosophy of Science

سال: 2019

ISSN: 0031-8248,1539-767X

DOI: 10.1086/703554